Search Results

  1. E. Hyytiä, Heuristic Algorithms for the Generalized Routing and Wavelength Assignment Problem, in Seventeenth Nordic Teletraffic Seminar, NTS-17, pp. 373-386, 2004, Fornebu, Norway (pdf)(bib)
    Abstract: In this paper a generalized (static) routing and wavelength assignment problem is formulated, where the objective is to establish a given set of connections into the network while minimizing the number of wavelength channels at the same time. Connections can be normal lightpaths as well as anycast or multicast connections. Furthermore, each request can be for either a bidirectional or a unidirectional connection. In this context, we consider appropriately modified versions of the heuristic algorithms proposed in the literature. The performance of the algorithms is compared by means of numerical examples.